A Semantic Formulation of TT-Lifting and Logical Predicates for Computational Metalanguage
نویسنده
چکیده
A semantic formulation of Lindley and Stark’s >>-lifting is given. We first illustrate our semantic formulation of the >>-lifting in Set with several examples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic >>-lifting as the lifting of strong monads across bifibrations with lifted symmetric monoidal closed structures.
منابع مشابه
Explorer Reducibility and TT - lifting for computation types
We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...
متن کاملReducibility and TT-Lifting for Computation Types
We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...
متن کاملA Sequent Formulation of a Logic of Predicates in HOL
By a predicate we mean a term in the HOL logic of type *-> bool, where * can be any type. Boolean connectives, quantiiers and sequents in the HOL logic can all be lifted to operate on predicates. The lifted logical operators and sequents form a Logic of Predicates (LP) whose behavior resembles closely that of the unlifted HOL logic. Of the applications of LP we describe two in some detail: (1) ...
متن کاملReducibility and >>-lifting for Computation Types
We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...
متن کاملA Contrastive Study of Request Speech Act in English and Persian Novels: Natural Semantic Metalanguage Approach
The Natural Semantic Metalanguage (NSM) Approach claims that there are some universalities in all languages. Speech acts seem to be present in all languages, but considering this approach, research has not indicated whether request speech act differs from one language to another. Thus, this study intended to investigate whether request strategies are used differently in English and Persian roma...
متن کامل